Kolmogorov's Contributions to the Foundations of Probability

نویسندگان

  • Vladimir Vovk
  • Glenn Shafer
چکیده

Andrei Nikolaevich Kolmogorov was the foremost contributor to the mathematical and philosophical foundations of probability in the twentieth century, and his thinking on the topic is still potent today. In this article we first review the three stages of Kolmogorov’s work on the foundations of probability: (1) his formulation of measure-theoretic probability, 1933, (2) his frequentist theory of probability, 1963, and (3) his algorithmic theory of randomness, 1965–1987. We also discuss another approach to the foundations of probability, based on martingales, that Kolmogorov did not consider.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Kolmogorov's Complexity Conception of Probability

Kolmogorov's goal in proposing his complexity conception of probability was to provide a better foundation for the applications of probability (as opposed to the theory of probability; he believed that his 1933 axioms were suucient for the theory of probability). The complexity conception was a natural development of Kolmogorov's earlier frequentist conception combined with (a) his conviction t...

متن کامل

Probability‎, ‎Frequency‎, ‎and Resonable Expectation‎

‎This paper is a Persian translation of R‎. ‎T‎. ‎Cox (1946) famous work concerning subjective probability‎. ‎It establishes an axiomatic foundation for subjective probability‎, ‎akin to Kolmogorov's work‎.

متن کامل

Imprecise Probability

1 Overview Quantification of uncertainty is mostly done by the use of precise probabilities: for each event A, a single (classical, precise) probability P (A) is used, typically satisfying Kolmogorov's axioms [4]. Whilst this has been very successful in many applications, it has long been recognized to have severe limitations. Classical probability requires a very high level of precision and co...

متن کامل

Kolmogorov's strong law of large numbers in game-theoretic probability: Reality's side

The game-theoretic version of Kolmogorov's strong law of large numbers says that Skeptic has a strategy forcing the statement of the law in a game of prediction involving Reality, Forecaster, and Skeptic. This note describes a simple matching strategy for Reality.

متن کامل

Kolmogorov's differential equations and positive semigroups on first moment sequence spaces.

Spatially implicit metapopulation models with discrete patch-size structure and host-macroparasite models which distinguish hosts by their parasite loads lead to infinite systems of ordinary differential equations. In several papers, a this-related theory will be developed in sufficient generality to cover these applications. In this paper the linear foundations are laid. They are of own intere...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Probl. Inf. Transm.

دوره 39  شماره 

صفحات  -

تاریخ انتشار 2003